Markov processes on vermiculated spaces
نویسندگان
چکیده
A general technique is given for constructing new Markov processes from existing ones. The new process and its state space are both projective limits of sequences built by an iterative scheme. The space at each stage in the scheme is obtained by taking disjoint copies of the space at the previous stage and quotienting to identify certain distinguished points. Away from the distinguished points, the process at each stage evolves like the one constructed at the previous stage on some copy of the previous state space, but when the process hits a distinguished point it enters at random another of the copies \pinned" at that point. Special cases of this construction produce di usions on fractal-like objects that have been studied recently.
منابع مشابه
On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملON THE GENERALIZATION OF N-PLE MARKOV PROCESSES
The notion of N-ple Markov process is defined in a quite general framework and it is shown that N-ple Markov processes-arel inear combinationso f some martingales
متن کاملSemi-pullbacks and bisimulation in categories of Markov processes
Received We show that the category whose objects are famidclies of Markov processes on Polish spaces, with a given transition kernel, and whose morphisms are transition probability preserving, surjective continuous maps has semi-pullbacks, i.e. for any pair of morphisms fi : Si ! S (i = 1; 2), there exists an object V and morphisms i : V ! Si (i = 1; 2) such that f1 1 = f2 2. This property hold...
متن کاملOn the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
Abstract. Calculating optimal policies is known to be computationally difficult for Markov decision processes with Borel state and action spaces and for partially observed Markov decision processes even with finite state and action spaces. This paper studies finite-state approximations of discrete time Markov decision processes with Borel state and action spaces, for both discounted and average...
متن کاملOn a comparison result for Markov processes
A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of stochastic orderings induced by a cone of real functions. The main result states that stochastic monotonicity of one process and comparability of the infinitesimal generators imply ordering of the processes. Several applications to convex type and to dependence orderings are given. In part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007